Improved classical simulation of quantum circuits dominated by Clifford gates: Supplemental Material
نویسندگان
چکیده
In this Section we state some facts concerning stabilizer groups and stabilizer states. Let Pn be the n-qubit Pauli group. Any element of Pn has the form iP1⊗ · · · ⊗Pn, where each factor Pa is either the identity or a singlequbit Pauli operator X,Y, Z and m ∈ Z4. An abelian subgroup G ⊆ Pn is called a stabilizer group if −I / ∈ G. Each stabilizer group has the form G = 〈G1, . . . , Gr〉 for some generating set of pairwise commuting self-adjoint Pauli operators G1, . . . , Gr ∈ G such that |G| = 2. The integer r is called the dimension of G and is denoted r = dim (G). A state |ψ〉 is said to be stabilized by G if P |ψ〉 = |ψ〉 for all P ∈ G. States stabilized by G span a “codespace” of dimension 2n−r. A projector onto a codespace has the form
منابع مشابه
Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates.
We present a new algorithm for classical simulation of quantum circuits over the Clifford+T gate set. The runtime of the algorithm is polynomial in the number of qubits and the number of Clifford gates in the circuit but exponential in the number of T gates. The exponential scaling is sufficiently mild that the algorithm can be used in practice to simulate medium-sized quantum circuits dominate...
متن کاملMatchgates and classical simulation of quantum circuits
Let G(A,B) denote the 2-qubit gate which acts as the 1-qubit SU(2) gates A and B in the even and odd parity subspaces respectively, of two qubits. Using a Clifford algebra formalism we show that arbitrary uniform families of circuits of these gates, restricted to act only on nearest neighbour (n.n.) qubit lines, can be classically efficiently simulated. This reproduces a result originally prove...
متن کاملClassical simulation complexity of extended Clifford circuits
Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations can be classically efficiently simulated but this is true only in a suitably restricted setting. Here we consider Clifford computations with a variety of additional ingredients: (a) strong vs. weak simulation, (b) inp...
متن کاملClassical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyond
The Gottesman-Knill theorem states that every “Clifford” quantum circuit, i.e., a circuit composed of Hadamard, CNOT and phase gates, can be simulated efficiently on a classical computer. It is was later found that a highly restricted classical computer (using only NOT and CNOT gates) suffices to simulate all Clifford circuits, implying that these circuits are most likely even significantly wea...
متن کاملClifford Gates in the Holant Framework
We show that the Clifford gates and stabilizer circuits in the quantum computing literature, which admit efficient classical simulation, are equivalent to affine signatures under a unitary condition. The latter is a known class of tractable functions under the Holant framework.
متن کامل